Lanczos iterated time-reversal.
نویسندگان
چکیده
A new iterative time-reversal algorithm capable of identifying and focusing on multiple scatterers in a relatively small number of iterations is developed. It is recognized that the traditional iterated time-reversal method is based on utilizing power iterations to determine the dominant eigenpairs of the time-reversal operator. The convergence properties of these iterations are known to be suboptimal. Motivated by this, a new method based on Lanczos iterations is developed. In several illustrative examples it is demonstrated that for the same number of transmitted and received signals, the Lanczos iterations based approach is substantially more accurate.
منابع مشابه
J an 2 00 6 The lower envelope of positive self - similar Markov processes . February 2 , 2008
We establish integral tests and laws of the iterated logarithm for the lower envelope of positive self-similar Markov processes at 0 and +∞. Our proofs are based on the Lamperti representation and time reversal arguments. These results extend laws of the iterated logarithm for Bessel processes due to Dvoretsky and Erdös [11], Motoo [17] and Rivero [18]. time reversal, integral test, law of the ...
متن کاملOn the future infimum of positive self-similar Markov processes
On the future infimum of positive self-similar Markov processes. Abstract We establish integral tests and laws of the iterated logarithm for the upper envelope of the future infimum of positive self-similar Markov processes and for increasing self-similar Markov processes at 0 and +∞. Our proofs are based on the Lamperti representation and time reversal arguments due to Chaumont and Pardo [9]. ...
متن کاملThe upper envelope of positive self-similar Markov processes
We establish integral tests and laws of the iterated logarithm at 0 and at +∞, for the upper envelope of positive self-similar Markov processes. Our arguments are based on the Lamperti representation, time reversal arguments and on the study of the upper envelope of their future infimum due to Pardo [19]. These results extend integral test and laws of the iterated logarithm for Bessel processes...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Journal of the Acoustical Society of America
دوره 125 2 شماره
صفحات -
تاریخ انتشار 2009